Superfast Algorithms and the Halting Problem in Geometric Algebra

摘要

A new type of algorithms is presented that combine the advantages of quantumand classical ones. Those combined advantages along with aspects of GeometricAlgebra that open possibilities unavailable to both of these computations areexploited to obtain database search and number factoring algorithms that arefaster than the quantum ones, and even to create a ''pseudoalgorithm'' that canperform noncomputational tasks.